More on generalizations of matrix monotonicity
نویسندگان
چکیده
منابع مشابه
On matrix estimation under monotonicity constraints
Abstract: We consider the problem of estimating an unknown n1×n2 matrix θ∗ from noisy observations under the constraint that θ∗ is nondecreasing in both rows and columns. We consider the least squares estimator (LSE) in this setting and study its risk properties. We show that the worst case risk of the LSE is n−1/2, up to multiplicative logarithmic factors, where n = n1n2 and that the LSE is mi...
متن کاملSupersymmetric Generalizations of Matrix Models
jedoch noch nicht hergeleitet werden. Abstract In this thesis generalizations of matrix and eigenvalue models involving supersym-metry are discussed. Following a brief review of the Hermitian one matrix model, the c = −2 matrix model is considered. Built from a matrix valued superfield this model displays supersymmetry on the matrix level. We stress the emergence of a Nicolai–map of this model ...
متن کاملMore Monotonicity Theorems for Partitions
Consider the collection of all integer partitions, whose part sizes lie in a given set. Such a set is called monotone if the generating function has weakly increasing coefficients. The monotone subsets are classified, assuming an open conjecture.
متن کاملA note on the monotonicity of matrix Riccati equations
In this note we show that the flow of matrix Riccati equations is monotone. Consequently, many results for Riccati equations can be obtained easily using standard as well as more recent results from the theory of monotone systems.
متن کاملJohnson’s Conjectures on Characteristic Polynomials of Matrix Pairs and Generalizations
For n× n matrices A and B define η(A,B) = ∑
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1982
ISSN: 0024-3795
DOI: 10.1016/0024-3795(82)90124-0